Geodesic Spanners for Points on a Polyhedral Terrain
نویسندگان
چکیده
Let S be a set S of n points on a polyhedral terrain T in R, and let ε > 0 be a fixed constant. We prove that S admits a (2 + ε)-spanner with O(n log n) edges with respect to the geodesic distance. This is the first spanner with constant spanning ratio and a near-linear number of edges for points on a terrain. On our way to this result, we prove that any set of n weighted points in R admits an additively weighted (2 + ε)-spanner with O(n) edges; this improves the previously best known bound on the spanning ratio (which was 5 + ε), and almost matches the lower bound. ∗Computer Engineering Department, Sharif University of Technology. Email: {abam,mjrezaei}@sharif.edu. †Department of Computer Science, TU Eindhoven, the Netherlands. Email: [email protected]. MdB was supported by the Netherlands’ Organisation for Scientific Research (NWO) under project no. 024.002.003. 1 ar X iv :1 51 1. 01 61 2v 1 [ cs .C G ] 5 N ov 2 01 5
منابع مشابه
Geodesic Spanners on Polyhedral Surfaces
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding spanners on the surface of a 3 dimensional polyhedron. If Steiner vertices are allowed on the surface of the polyhedron, then we are able to construct sparse t-spanners. If no Steiner vertices are allowed, then we establish lower bounds on the maximum node degree, depending on the spanning...
متن کاملPresenting a Morphological Based Approach for Filtering The Point Cloud to Extract the Digital Terrain Model
The Digital terrain model is an important geospatial product used as the basis of many practical projects related to geospatial information. Nowadays, a dense point cloud can be generated using the LiDAR data. Actually, the acquired point cloud of the LiDAR, presents a digital surface model that contains ground and non-ground objects. The purpose of this paper is to present a new approach of ex...
متن کاملOptimistic shortest paths on uncertain terrains
Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a shortest path involve a variant of Dijkstra’...
متن کاملApproximate Shortest Descent Path on a Terrain
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on the path, if dist(s, p) < dist(s, q) then z(p) ≥ z(q), where dist(s, p) denotes the distance of p from s along the aforesaid path. Although an efficient algorithm to decide if there is a descending path between two point...
متن کاملShortest Monotone Descent Path Problem in Polyhedral Terrain
Given a polyhedral terrain with n vertices, the shortest monotone descent path problem deals with finding the shortest path between a pair of points, called source (s) and destination (t) such that the path is constrained to lie on the surface of the terrain, and for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on the path, if dist(s,p) < dist(s, q) then z(p) z(q), whe...
متن کامل